Generalization of ν Path Planning For Accommodation of Amortized Dynamic Uncertainties in Plan Execution
نویسندگان
چکیده
A significant generalization to the language-measuretheoretic path planning algorithm ν is presented that accounts for average dynamic uncertainties in plan execution. The planning problem thus can be solved with parametric input from the dynamics of the robotic platform under consideration. Applicability of the algorithm is demonstrated in a simulated maze solution and by experimental validation on a mobile robotic platform in the laboratory environment.
منابع مشابه
Formal-language-theoretic Optimal Path Planning For Accommodation of Amortized Uncertainties and Dynamic Effects
We report a globally-optimal approach to robotic path planning under uncertainty, based on the theory of quantitative measures of formal languages. A significant generalization to the language-measure-theoretic path planning algorithm ν is presented that explicitly accounts for average dynamic uncertainties and estimation errors in plan execution. The notion of the navigation automaton is gener...
متن کاملΝ☆: a Robot Path Planning Algorithm Based on Renormalised Measure of Probabilistic Regular Languages
This article introduces a novel path planning algorithm, called m, that reduces the problem of robot path planning to optimisation of a probabilistic finite state automaton. The m-algorithm makes use of renormalised measure m of regular languages to plan the optimal path for a specified goal. Although the underlying navigation model is probabilistic, the m-algorithm yields path plans that can b...
متن کاملFully Dynamic All Pairs All Shortest Paths
We consider the all pairs all shortest paths (APASP) problem, which maintains all of the multiple shortest paths for every vertex pair in a directed graph G = (V,E) with a positive real weight on each edge. We present a fully dynamic algorithm for this problem in which an update supports either weight increases or weight decreases on a subset of edges incident to a vertex. Our algorithm runs in...
متن کاملA Faster Algorithm for Fully Dynamic Betweenness Centrality
We present a new fully dynamic algorithm for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V,E) with positive edge weights. BC is a widely used parameter in the analysis of large complex networks. We achieve an amortized O(ν · log n) time per update, where n = |V | and ν bounds the number of distinct edges that lie on shortest paths through any single vertex. This...
متن کاملRobot Path Planning in Uncertain Environments: A Language Measure-theoretic Approach
This paper addresses the problem of goal-directed robot path-planning in the presence of uncertainties that are induced by bounded environmental disturbances and actuation errors. The offline infinite-horizon optimal plan is locally updated by online finite-horizon adaptive re-planning upon observation of unexpected events (e.g., detection of unanticipated obstacles). The underlying theory is d...
متن کامل